A Bidder Aid Tool for Dynamic Package Creation in the FCC Spectrum Auctions

نویسندگان

  • Karla Hoffman
  • Dinesh Menon
  • Susara A. van den Heever
چکیده

We propose a bidder aid tool that will allow bidders to more effectively participate in combinatorial FCC spectrum auctions by enabling concise expression of preferences. In addition to logical relationships between items, bidders may express spectrum-specific preferences such as those related to minimum population coverage, bandwidth, and budget. The tool can be used to simultaneously generate and valuate the optimal set biddable packages, both at the start of the auction and dynamically before each round. Preliminary testing suggests that the use of this tool may significantly simplify bidders’ efforts in generating packages of interest, and thus lead to more efficient auction outcomes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Package Bidding Tool for the Fcc’s Spectrum Auctions, and Its Effect on Auction Outcomes

We present a bidder aid tool that allows bidders to more effectively participate in combinatorial FCC spectrum auctions by enabling concise expression of preferences. In addition to logical relationships between items, bidders may express spectrum-specific preferences such as those related to minimum population coverage, bandwidth, and budget. The tool can be used to simultaneously generate and...

متن کامل

Putting Auction Theory to Work: Ascending Auctions with Package Bidding

Ascending auctions with package bidding and their economic uses are explained and the main results of recent FCC-sponsored experiments with such auctions are summarized. A benchmark model is formulated that accounts for the experimental results. In the benchmark, if each bidder bids “straightforwardly” at each round for its potentially most profitable package, then the total payoff is approxima...

متن کامل

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions

When combinatorial bidding is permitted in auctions, such as the proposed FCC auction #31, the resulting full valuations and winner-determination problem can be computationally challenging. We present a branch-and-price algorithm based on a set-packing formulation originally proposed by Dietrich and Forrest (2002). This formulation has a variable for every possible combination of winning bids f...

متن کامل

Poster Summary: Towards Large-Scale Economic-Robust Spectrum Auctions

Dynamic spectrum auction is an effective solution to manage spectrum across many small networks. Yet without proper economic design, spectrum auctions can be easily manipulated by bidders, suffering huge efficiency loss. Selfish bidders can manipulate their bids, individually or in groups, to game the system and obtain outcomes that favor their own interests and hurt others. Prior solutions hav...

متن کامل

Collusive Bidding in the FCC Spectrum Auctions

This paper describes the signaling that occurred in many of the FCC spectrum auctions. The FCC’s simultaneous ascending auctions allowed bidders to bid on numerous communication licenses simultaneously, with bidding remaining open on all licenses until no bidder was willing to raise the bid on any license. Simultaneous open bidding allowed bidders to send messages to their rivals, telling them ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004